def findNumbersWithSum(array, tsum):
    """
    array中任意2个数的和为tsum, 找出这2个数, 若有多对, 返回乘积最小的那一对
    :param array:
    :param tsum:
    :return:
    """
    ret_list = [0, 0]
    min = None
    for i in array:
        for j in array:
            if i + j == tsum:
                if min is None:
                    min = i * j
                ret_list[0] = i
                ret_list[1] = j
                if i * j < min:
                    min = i * j
    if min is None:
        return []
    if ret_list[0] > ret_list[1]:
        ret_list[0], ret_list[1] = ret_list[1], ret_list[0]
    return ret_list


print(findNumbersWithSum([1,2,4,7,11,16], 10))
